Recognizing permutation functions in polynomial time
نویسنده
چکیده
Let Fq be a finite field and f(x) ∈ Fq(x) be a rational function over Fq. The decision problem PermFunction consists of deciding whether f(x) induces a permutation on the elements of Fq. That is, we want to decide whether the corresponding map f : Fq 7→ Fq defined by a 7→ f(a) is a bijective mapping or not. This problem was known to be in ZPP but not known to be in P. We resolve the complexity of PermFunction by giving a deterministic polynomial-time algorithm for this problem.
منابع مشابه
Circulant Graphs: Recognizing and Isomorphism Testing in Polynomial Time
An algorithm is constructed for recognizing the circulant graphs and finding a canonical labeling for them in polynomial time. This algorithm also yields a cycle base of an arbitrary solvable permutation group. The consistency of the algorithm is based on a new result on the structure of Schur rings over a finite cyclic group. §
متن کاملLength of polynomials over finite groups
We study the length of polynomials over nite simple non-Abelian groups needed to realize Boolean functions. We apply the results for bounding the length of 5-permutation branching programs recognizing a Boolean set. Moreover, for Boolean and general functions on these groups, we present upper bounds on the length of shortest polynomials computing an arbitrary nary Boolean or general function, o...
متن کاملRecognizing Dart - Free Perfect Graphs 1317
A graph G is called a Berge graph if neither G nor its complement contains a chordless cycle whose length is odd and at least five; what we call a dart is the graph with vertices u, v, w, x, y and edges uv, vw, uy, vy, wy, xy; a graph is called dart-free if it has no induced subgraph isomorphic to the dart. We present a polynomial-time algorithm to recognize dart-free Berge graphs; this algorit...
متن کاملCommunication Complexity of Permutation-Invariant Functions
Motivated by the quest for a broader understanding of upper bounds in communication complexity, at least for simple functions, we introduce the class of “permutation-invariant” functions. A partial function f : {0, 1} × {0, 1} → {0,1, ?} is permutation-invariant if for every bijection π : {1, . . . , n} → {1, . . . , n} and every x,y ∈ {0, 1}, it is the case that f (x,y) = f (x,y). Most of the ...
متن کاملExtending Partial Representations of Function Graphs and Permutation Graphs
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0, 1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear. We focus on the problem of extending partial representations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005